Size functions
نویسندگان
چکیده
منابع مشابه
Background Overlay Grid Size Functions
This paper describes a new technology of mesh size control using a background overlay grid size function. A background overlay grid is generated first according to the defined size functions and then is used as the base grid for determining the mesh size at each point during the meshing process. The definitions, classifications, implementations and control algorithms of three types of size func...
متن کاملUniversal Finite-size-scaling Functions
The idea of universal finite-size-scaling functions of the Ising model is tested by Monte Carlo simulations for various lattices. Not only regular lattices such as the square lattice but quasiperiodic lattices such as the Penrose lattice are treated. We show that the finite-size-scaling functions of the order parameter for various lattices are collapsed on a single curve by choosing two nonuniv...
متن کاملDeformation Energy for Size Functions
Size functions are functions from the real plane to the natural numbers useful for describing shapes of objects. They allow to translate the problem of comparing shapes to the problem of comparing functions, that is a much simpler task. In order to perform the comparison between size functions we present a method to measure the energy necessary to deform size functions into each other. Minimizi...
متن کاملPolynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be matrix multiplication and the Cartesian product of two lists. The type checking problem for the type system is shown to be u...
متن کاملRanking Functions for Size-Change Termination II
The Size-Change Termination technique is based on a program abstraction for which termination is decidable. Termination is verified by a set of local termination proofs that account for all cycles in a control-flow graph. We present algorithms that construct a global ranking function for an SCT instance. Such functions serve as easy-to-check witnesses for termination, and are therefore interest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2004
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm183-2-2